Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties
نویسنده
چکیده
An additive hereditary graph property is any class of simple graphs, which is closed under isomorphisms unions and taking subgraphs. Let La denote a class of all such properties. In the paper, we consider Hreducible over La properties with H being a fixed graph. The finiteness of the sets of all minimal forbidden graphs is analyzed for such properties.
منابع مشابه
Minimal forbidden subgraphs of reducible graph properties
A property of graphs is any class of graphs closed under isomorphism. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable if the vertex set V (G) can be partitioned into n sets, {V1, V2, . . . , Vn}, such that for each i = 1, 2, . . . , n, the graph G[Vi] ∈ Pi. We write P1◦P2◦ · · · ◦Pn for the property of all graphs which have a (P1,P2, . . . ,Pn)-partit...
متن کاملA Note on Joins of Additive Hereditary Graph Properties
Let L denote a set of additive hereditary graph properties. It is a known fact that a partially ordered set (La,⊆) is a complete distributive lattice. We present results when a join of two additive hereditary graph properties in (La,⊆) has a finite or infinite family of minimal forbidden subgraphs.
متن کاملOn invariants of hereditary graph properties
The product P◦Q of graph properties P,Q is a class of all graphs having a vertex-partition into two parts inducing subgraphs with properties P and Q, respectively. For a graph invariant φ and a graph property P we define φ(P) as the minimum of φ(F ) taken over all minimal forbidden subgraphs F of P . An invariant of graph properties φ is said to be additive with respect to reducible hereditary ...
متن کاملMinimal reducible bounds for hom-properties of graphs
Let H be a fixed finite graph and let → H be a hom-property, i.e. the set of all graphs admitting a homomorphism into H . We extend the definition of → H to include certain infinite graphs H and then describe the minimal reducible bounds for → H in the lattice of additive hereditary properties and in the lattice of hereditary properties.
متن کاملUniqueness and complexity in generalised colouring
The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition of a family of graphs that are colourable according to certain rules. In this thesis, we study additive induced-hereditary families, and some generalisations, from a colour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 29 شماره
صفحات -
تاریخ انتشار 2009